42 research outputs found
Replica Placement on Bounded Treewidth Graphs
We consider the replica placement problem: given a graph with clients and
nodes, place replicas on a minimum set of nodes to serve all the clients; each
client is associated with a request and maximum distance that it can travel to
get served and there is a maximum limit (capacity) on the amount of request a
replica can serve. The problem falls under the general framework of capacitated
set covering. It admits an O(\log n)-approximation and it is NP-hard to
approximate within a factor of . We study the problem in terms of
the treewidth of the graph and present an O(t)-approximation algorithm.Comment: An abridged version of this paper is to appear in the proceedings of
WADS'1
An objective based classification of aggregation techniques for wireless sensor networks
Wireless Sensor Networks have gained immense popularity in recent years due to their ever increasing capabilities and wide range of critical applications. A huge body of research efforts has been dedicated to find ways to utilize limited resources of these sensor nodes in an efficient manner. One of the common ways to minimize energy consumption has been aggregation of input data. We note that every aggregation technique has an improvement objective to achieve with respect to the output it produces. Each technique is designed to achieve some target e.g. reduce data size, minimize transmission energy, enhance accuracy etc. This paper presents a comprehensive survey of aggregation techniques that can be used in distributed manner to improve lifetime and energy conservation of wireless sensor networks. Main contribution of this work is proposal of a novel classification of such techniques based on the type of improvement they offer when applied to WSNs. Due to the existence of a myriad of definitions of aggregation, we first review the meaning of term aggregation that can be applied to WSN. The concept is then associated with the proposed classes. Each class of techniques is divided into a number of subclasses and a brief literature review of related work in WSN for each of these is also presented
A Multi-objective Approach for Data Collection in Wireless Sensor Networks
International audienceWireless sensors networks (WSNs) are deployed to collect huge amounts of data from the environment. This produced data has to be delivered through sensor's wireless interface using multi-hop communications toward a sink. The position of the sink impacts the performance of the wireless sensor network regarding delay and energy consumption especially for relaying sensors. Optimizing the data gathering process in multi-hop wireless sensor networks is, therefore, a key issue. This article addresses the problem of data collection using mobile sinks in a WSN. We provide a framework that studies the trade-off between energy consumption and delay of data collection. This framework provides solutions that allow decision makers to optimally design the data collection plan in wireless sensor networks with mobile sinks
Fast Algorithms to Implement N-FINDR for Hyperspectral Endmember Extraction
The N-finder algorithm (N-FINDR) suffers from several issues in its practical implementation. One is its search region which is usually the entire data space. Another related issue is its excessive computation. A third issue is its use of random initial conditions which causes inconsistency in final results that can not be reproducible if a search for endmembers is not exhaustive. This paper resolves the first two issues by developing two approaches to speed-up of the N-FINDR computation while implementing a recently developed random pixel purity index (RPPI) to alleviate the third issue. First of all, it narrows down the search region for the N-FINDR to a feasible range, called region of interest (ROI), where two ways are proposed, data sphering/thresholding and RPPI, to be used as a pre-processing to find a desired ROI. Second, three methods are developed to reduce computing load of simplex volume computation by simplifying matrix determinant. Third, to further reduce computational complexity three sequential N-FINDR algorithms are implemented by finding one endmember after another in sequence instead of finding all endmembers together at once. The conducted experiments demonstrate that while the proposed fast algorithms can greatly reduce computational complexity, their performance remains as good as the N-FINDR is and is not compromised by reduction of the search region to an ROI